Canonical matrices for linear matrix problems
نویسندگان
چکیده
منابع مشابه
Canonical Matrices for Linear Matrix Problems
We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskĭı’s algorithm for reducing a matrix to a canonical form, which is the generalization of the Jordan normal form, and study the set Cmn of indecomposable canonical m× n matrices. Considering Cmn as a subset in ...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملConnection Matrices for Ultradiscrete Linear Problems
We present theory outlining the linear problems associated with ultradiscrete equation. The appropriate domain for such problems being the max-plus semiring. Our main result being that despite the restrictive nature of this semiring, it is still possible to define a theory of monodromy analogous to that of Birkhoff and his school for systems of linear difference equations over the max-plus semi...
متن کاملHaar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems
In this paper, Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems. Firstly, using necessary conditions for optimality, the problem is changed into a two-boundary value problem (TBVP). Next, Haar wavelets are applied for converting the TBVP, as a system of differential equations, in to a system of matrix algebraic equations...
متن کاملMatrix Linear Complementarity Problems
We consider the expected residual minimization formulation of the stochastic R0 matrix linear complementarity problem. We show that the involved matrix being a stochastic R0 matrix is a necessary and sufficient condition for the solution set of the expected residual minimization problem to be nonempty and bounded. Moreover, local and global error bounds are given for the stochastic R0 matrix li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00150-6